Factorization of numbers with Gauss sums: I. Mathematical background
نویسندگان
چکیده
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and scales exponentially. 4 Author to whom any correspondence should be addressed. New Journal of Physics 13 (2011) 103007 1367-2630/11/103007+37$33.00 © IOP Publishing Ltd and Deutsche Physikalische Gesellschaft
منابع مشابه
NMR implementations of Gauss sums
I describe the use of NMR experiments which implement Gauss sums as a method for factoring numbers and discuss whether this approach can be computationally useful.
متن کاملA hybrid mean value involving a new Gauss sums and Dedekind sums
In this paper, we introduce a new sum analogous to Gauss sum, then we use the properties of the classical Gauss sums and analytic method to study the hybrid mean value problem involving this new sums and Dedekind sums, and give an interesting identity for it.
متن کاملar X iv : 0 70 9 . 14 24 v 1 [ qu an t - ph ] 1 0 Se p 20 07 Gauss sum factorization with cold atoms
The Shor algorithm [1] to factor numbers and its NMRimplementation [2] have propelled the field of quantum computation [3]. Recently a different factorization scheme [4] taking advantage of the periodicity properties of Gauss sums [5] has been proposed [6] and verified by two NMR-experiments [7, 8] and one experiment based on short laser pulses [9]. In the present paper we report the first impl...
متن کاملWaring's Problem, Taxicab Numbers, and Other Sums of Powers
1. Introduction. Many of the most perplexing problems in number theory arise from the interplay of addition and multiplication. One important class of such problems is those in which we ask which numbers can be expressed as sums of some numbers which are defined multiplicatively. Such classes of numbers include nth powers (in this paper, for any fixed n; in a more general treatment, n could als...
متن کاملFast Computation of Gauss Sums and Resolution of the Root of Unity Ambiguity
We present an algorithm for computing Gauss sums over Fq for large prime powers q. This allows us to find the exact values of Gauss sums in many previously intractable cases. The efficient computation of such Gauss sums up to multiplication with a root of unity is achieved by using Stickelberger’s factorization of Gauss sums, an application of the Fincke-Pohst algorithm, and fast arithmetic for...
متن کامل